Compilation Based on a Calculus for Explicit Type Passing
نویسنده
چکیده
We propose several calculi for explicit type passing that enable us to formalize compilation of polymorphic programming languages like ML as phases of type preserving translations In our calculi various manipulations for type parameters can be expressed without typing problems this is impossible in the polymorphic calculi Furthermore we develop the translation from an explicit typed source calculus similar to Core XML to one of the proposed calculi which completely eliminates runtime construction type parameters We propose an intermediate language based on this calculus and discuss an implementation of a compiler for Core Standard ML
منابع مشابه
On the Relation of Interaction Semantics to Continuations and Defunctionalization
In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues. Such models have recently been used in the design of new compilation methods, e.g. for hardware synthesis or for programming with sublinear space. This paper relates such semantically motivated non-standard compilation methods to more standard techniques in the compilation...
متن کاملSound and Complete Axiomatisations of Call-by-Value Control Operators
We formulate a typed version of call-by-value-calculus containing variants of Felleisen's control operators A and C which provide explicit access to continuations and logically extend the propositions-as-types correspondence to classical propositional logic. We give an equational theory for this calculus which is shown to be sound and complete with respect to to a class of categorical models ba...
متن کاملEquivalence-Preserving Compilation
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different language, this is true only if the translation process preserves observational equivalence. We investigate the problem of fully abstract compilation, i.e., compilation that both preserves and reflects observational equivalenc...
متن کاملAlgebraic Pattern Matching in Join Calculus
We propose an extension of the join calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a practical compilation scheme from extended join definitions into ordinary ones plus ML pattern matching. To assess the correctness of our compilation scheme, we de...
متن کاملar X iv : 0 80 2 . 40 18 v 1 [ cs . P L ] 2 7 Fe b 20 08 ALGEBRAIC PATTERN MATCHING IN JOIN CALCULUS
We propose an extension of the join calculus with pattern matching on algebraic data types. Our initial motivation is twofold: to provide an intuitive semantics of the interaction between concurrency and pattern matching; to define a practical compilation scheme from extended join definitions into ordinary ones plus ML pattern matching. To assess the correctness of our compilation scheme, we de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996